GRASP with path relinking for the selective pickup and delivery problem
نویسندگان
چکیده
منابع مشابه
GRASP with path relinking heuristics for the antibandwidth problem
This paper proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2, . . . , n}, such that, among all adjacent node pairs, the minimum difference be...
متن کاملRevised GRASP with path-relinking for the linear ordering problem
W. Art Chaovalitwongse Department of Industrial and Systems Engineering, Rutgers University 96 Frelinghuysen Rd., Piscataway, New Jersey 08854, USA [email protected] Carlos A.S. Oliveira Princeton Consultants Inc. 2 Research Way, Princeton, NJ 08540 [email protected] Bruno Chiarini PO Box 522274, Miami, FL 33152. [email protected] Panos M. Pardalos Department of Industrial and Syst...
متن کاملGRASP with path relinking for the orienteering problem
In this paper, we address an optimization problem resulting from the combination of the wellknown traveling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sports, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travellin...
متن کاملGRASP with Path Relinking for the SumCut Problem
This paper proposes a GRASP algorithm combined with Path Relinking to solve the SumCut minimization problem. In the SumCut problem one is given a graph with n nodes and must label the nodes in a way that each node receives a unique label from the set{1, 2, ... , n}, in order to minimize the sum cut of the generated solution. The SumCut problem is really important in archeology (in seriation tas...
متن کاملGrasp with Path Relinking for the Three-index Assignment Problem
Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2016
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2015.12.015